#include<cstdio>//uncle-lu
#include<algorithm>
template<class T>void read(T &x)
{
	x=0;int f=0;char ch=getchar();
	while(ch<'0'||ch>'9') { f|=(ch=='-'); ch=getchar(); }
	while(ch<='9'&&ch>='0') { x=(x<<1)+(x<<3)+(ch^48); ch=getchar(); }
	x = f ? -x : x;
	return ;
}

long long int F[4010];
int n;

int main()
{
	read(n);
	F[0] = 1;
	for (int i = 1; i <= n; i++) 
	{
		for (int j = i; j <= n; j++) 
		{
			F[j] = ( F[j] + F[j-i] ) % 2147483648;
		}
	}

	printf("%lld", F[n]-1);
	return 0;
}
